Logical foundations for programming semantics
نویسندگان
چکیده
منابع مشابه
Logical Foundations for Declarative Object-oriented Programming Logical Foundations for Declarative Object-oriented Programming ?
We present a formalism for reasoning about declarative object-oriented programs. Classes are represented as rst-order theories that contain logic programs as methods. Inheritance, genericity and related concepts are represented by operations on such theories which preserve the consistency of these theories as well as the correctness of the programs speciied by their axioms. Our approach provide...
متن کاملLogical Foundations for Declarative Object-oriented Programming
We present a formalism for reasoning about declarative object-oriented programs. Classes are represented as first-order theories that contain logic programs as methods. Inheritance, genericity and related concepts are represented by operations on such theories which preserve the consistency of these theories as well as the correctness of the programs specified by their axioms. Our approach prov...
متن کاملLogical Foundations of Well-Founded Semantics
We propose a solution to a long-standing problem in the foundations of well-founded semantics (WFS) for logic programs. The problem addressed is this: which (non-modal) logic can be considered adequate for well-founded semantics in the sense that its minimal models (appropriately defined) coincide with the partial stable models of a logic program? We approach this problem by identifying the HT ...
متن کاملAbstracts of invited talks in the Special Session on Logical Foundations of Programming Semantics
s of invited talks in the Special Session on Logical Foundations of Programming Semantics ANDREJ BAUER AND CHRISTOPHER STONE, From theories to signatures. Department of Mathematics and Physics, University of Ljubljana, Jadranska 19 Slovenia. E-mail: [email protected]. Computer Science Department, Harvey Mudd College, 1250 North Dartmouth Avenue, Claremont, CA 91711, USA. E-mail: stone@cs....
متن کاملProgramming Towards a Roberto Barbuti ” , logical semantics for pure Prolog ’
The coincidence of the declarative and procedural interpretations of logic programs does not apply to Prolog programs, due to the depth-first left-to-right evaluation strategy of Prolog interpreters. We propose a semantics for Prolog programs based on a four-valued logic. The semantics is based on a new concept of completion analogous to Clark’s and it enjoys the nice properties of the declarat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1993
ISSN: 0304-3975
DOI: 10.1016/0304-3975(93)90189-z